Representation of Torsion Points on Pairing Curves of Embedding Degree 1

نویسندگان

  • Yasuyuki NOGAMI
  • Taichi SUMO
چکیده

Recent efficient pairings such as Ate pairing use two efficient rational point subgroups such that π(P ) = P and π(Q) = [p]Q, where π, p, P , and Q are the Frobenius map for rational point, the characteristic of definition field, and torsion points for pairing, respectively. This relation accelerates not only pairing but also pairing–related operations such as scalar multiplications. It holds in the case that the embedding degree k divides r − 1, where r is the order of torsion rational points. Thus, such a case has been well studied. Alternatively, this paper focuses on the case that the degree divides r + 1 but does not divide r − 1. Then, this paper shows a multiplicative representation for r–torsion points based on the fact that the characteristic polynomial f(π) becomes irreducible over Fr for which π also plays a role of variable.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pairing Computation on Elliptic Curves with Efficiently Computable Endomorphism and Small Embedding Degree

Scott uses an efficiently computable isomorphism in order to optimize pairing computation on a particular class of curves with embedding degree 2. He points out that pairing implementation becomes thus faster on these curves than on their supersingular equivalent, originally recommended by Boneh and Franklin for Identity Based Encryption. We extend Scott’s method to other classes of curves with...

متن کامل

Pairing-friendly Elliptic Curves of Embedding Degree 1 and Applications to Cryptography

Recently, Wang et al. [1] proposed a new method for constructing pairingfriendly elliptic curves of embedding degree 1. Authors claim that this method significantly improves the efficiency of generating elliptic curves. In this paper, we give the arithmetic of pairing-friendly elliptic curves of embedding degree 1. We prove that conventional classification of pairings into Type 1, 2, 3 and 4 is...

متن کامل

Torsion Points on Modular Curves

Let N ≥ 23 be a prime number. In this paper, we prove a conjecture of Coleman, Kaskel, and Ribet about the Q-valued points of the modular curve X0(N) which map to torsion points on J0(N) via the cuspidal embedding. We give some generalizations to other modular curves, and to noncuspidal embeddings of X0(N) into J0(N).

متن کامل

A study of pairing computation for curves with embedding

This paper presents the first study of pairing computation on curves with embedding degree 15. We compute the Ate and the twisted Ate pairing for a family of curves with parameter ρ 1.5 and embedding degree 15. We use a twist of degree 3 to perform most of the operations in Fp or Fp5 . Furthermore, we present a new arithmetic for extension fields of degree 5. Our computations show that these cu...

متن کامل

Faster Pairing Computation

This paper proposes new explicit formulas for the doubling and addition step in Miller’s algorithm to compute pairings. For Edwards curves the formulas come from a new way of seeing the arithmetic. We state the first geometric interpretation of the group law on Edwards curves by presenting the functions which arise in the addition and doubling. Computing the coefficients of the functions and th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012